ExtrudeNet: Unsupervised Inverse Sketch-and-Extrude for Shape Parsing

نویسندگان

چکیده

Sketch-and-extrude is a common and intuitive modeling process in computer aided design. This paper studies the problem of learning shape given form point clouds by “inverse” sketch-and-extrude. We present ExtrudeNet, an unsupervised end-to-end network for discovering sketch extrude from clouds. Behind ExtrudeNet are two new technical components: 1) effective representation extrude, which can model extrusion with freeform sketches conventional cylinder box primitives as well; 2) numerical method computing signed distance field used learning. first attempt that uses machine to reverse engineer sketch-and-extrude fashion. not only outputs compact, editable interpretable be seamlessly integrated into modern CAD software, but also aligns standard facilitating various editing applications, distinguishes our work existing parsing research. Code released at https://github.com/kimren227/ExtrudeNet .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concavity and Initialization for Unsupervised Dependency Parsing

We investigate models for unsupervised learning with concave log-likelihood functions. We begin with the most well-known example, IBM Model 1 for word alignment (Brown et al., 1993) and analyze its properties, discussing why other models for unsupervised learning are so seldom concave. We then present concave models for dependency grammar induction and validate them experimentally. We find our ...

متن کامل

Unsupervised Semantic Parsing

We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, recursively induces lambda forms from these, and clusters them to abstract away syntactic variations of the same meaning. The MAP semantic parse of a sentence is obtained by recursively assigning its parts to lambda-for...

متن کامل

Fast Unsupervised Incremental Parsing

This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structure similar to dependency links which is well-suited for incremental parsing. In contrast to previous unsupervised parsers, the parser does not use part-of-speech tags and both learning and parsing are local and fast, re...

متن کامل

Grounded Unsupervised Semantic Parsing

We present the first unsupervised approach for semantic parsing that rivals the accuracy of supervised approaches in translating natural-language questions to database queries. Our GUSP system produces a semantic parse by annotating the dependency-tree nodes and edges with latent states, and learns a probabilistic grammar using EM. To compensate for the lack of example annotations or question-a...

متن کامل

Unsupervised Neural Dependency Parsing

Unsupervised dependency parsing aims to learn a dependency grammar from text annotated with only POS tags. Various features and inductive biases are often used to incorporate prior knowledge into learning. One useful type of prior information is that there exist correlations between the parameters of grammar rules involving different POS tags. Previous work employed manually designed features o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-20086-1_28